Edge Domination in Intuitionistic Fuzzy Graphs
نویسنده
چکیده
In this paper we introduce the concept of edge domination and total edge domination in intuitionistic fuzzy graphs. We determine the edge domination number and total edge domination number for several classes of intuitionistic fuzzy graphs and obtain bounds for them. We also obtain Nordhaus gaddum type results for the parameters.
منابع مشابه
Edge Domination on Intuitionistic Fuzzy Graphs
Let D be the minimum dominating set of intuitionistic fuzzy graph G. The minimum intuitionistic fuzzy cardinality of all edge dominating set of intuitionistic fuzzy graph G is known as edge domination number and it is denoted by γe(G). In this Paper, we initiate some definitions onedge dominating set concerning intuitionistic fuzzy sets. Further, we investigate some results onedge domination nu...
متن کاملNon Split Domination on Intuitionistic Fuzzy Graphs
A dominating set D of an IFG G = (V, E) is a non-split dominating set, if the induced intuitionistic fuzzy subgraph 〈ܸ − 〉ܦ is connected. The Non-split domination number ߛ ௦ ሺܩሻ of IFG G is the minimum cardinality of all Non-split dominating set. In this paper we study some theorems in Non-split dominating sets of IFG and some results of ߛ ௦ ሺܩሻwith other known parameters of IFG G. 1. In...
متن کاملSome Domination Parameters on Interval Valued Intuitionistic Fuzzy Graphs
In this paper, we define Some domination parameters on IVIFG and derive some relations and then verify by using Interval valued intuitionistic fuzzy graphs and discussed some properties. Also, we introduced Immoderate semi-complete IVIFG and its properties.
متن کاملTotal Semi - μ Strong (Weak) Domination in Intuitionistic Fuzzy Graph
In the initial stage we proposed the concept of Total Strong (Weak) domination in Fuzzy graph. It deal with the real time application that helps a individual person in crossing a road traffic signal. We will be giving a single value for vertices and edges. Enhancing the same concept, the Total Strong (Weak) domination in Intuitionistic Fuzzy graph was proposed. Here we will be giving a double v...
متن کاملOn the signed Roman edge k-domination in graphs
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
متن کامل